A Distributed Table-Driven Route Selection Scheme for Establishing Real-Time Video Channels

To guarantee the delivery of real-time messages before their deadline, a real-time channel or connection must be established before the transmission of any real-time messages. During this channel-establishment phase, one must rst select a route between the source and destination of this channel and then reserve suucient resources along this route so that the worst-case end-to-end delay over the selected route may not exceed the user-speciied delay bound. We propose a table-driven distributed route-selection scheme that is guaranteed to nd a \qualiied" route, if any, that meets the performance requirement of the requested channel without compromising any of the existing guarantees. The proposed scheme uses the Bellman-Ford shortest path algorithm to build real-time delay tables, and hence, can solve the route-selection problem by a simple table look-up. Several examples are presented to demonstrate the eeectiveness of the proposed distributed route-selection scheme. Any opinions, ndings, and conclusions or recommendations expressed in this paper are those of the authors and do not necessarily reeect the view of the funding agencies.